Routing and Embeddings in Cyclic Petersen Networks: An Efficient Extension of the Petersen Graph
نویسندگان
چکیده
The Petersen graph is a Moore graph that has node degree 3, diameter 2, and optimal network size 10. In this paper, we present a class of interconnection networks, called cyclic Petersen networks (CPNs), which efficiently extend the Petersen graph to obtain larger networks with small diameter and node degree. We derive balanced routing algorithms and efficient embeddings for CPNs. In particular, we show that many normal mesh algorithms can be emulated on CPNs with a slowdown factor of about 1.1. We also show that complete CPNs can embed meshes, tori, meshes of trees, and folded Petersen networks with dilation 3, hypercubes and generalized hypercubes with dilation 4, and pyramids with dilation 5.
منابع مشابه
SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملQoS Routing in General Petersen-Torus Networks: A Case Study
Petersen-Torus as an interconnection network was extensively studied. This letter proposed two elementary algorithms for QoS routing in general Petersen-Torus networks, which can be modeled as graph ( , ) PT m n with K QoS parameters associated with each edge. Theoretic analysis for the proposed algorithms was conducted. And the time complexity of these two algorithms was summarized and compare...
متن کامل